Browsing by Subject "Communication rounds"
Now showing items 1-4 of 4
-
Conference Object
Analyzing the number of slow reads for semifast atomic read/write register implementations
(2009)Developing fast implementations of atomic read/write registers in the message passing model is among the fundamental problems in distributed computing. Typical implementations require two communication round trips for read ...
-
Conference Object
Brief announcement: On the robustness of (semi)fast quorum-based implementations of atomic shared memory
(2008)Atomic (linearizable) read/write memory is a fundamental abstractions in distributed computing. Following a seminal implementation of atomic memory of Attiya et al.[6], a folklore belief developed that in messaging-passing ...
-
Conference Object
Fault-tolerant semi fast implementations of atomic read/write registers
(2006)This paper investigates time-efficient implementations of atomic read-write registers in message-passing systems where the number of readers can be unbounded. In particular we study the case of a single writer, multiple ...
-
Article
Fault-tolerant semifast implementations of atomic read/write registers
(2009)This paper investigates time-efficient implementations of atomic read-write registers in message-passing systems where the number of readers can be unbounded. In particular we study the case of a single writer, multiple ...